Fast, Fair and Frugal Bandwidth Allocation in ATM Networks
نویسندگان
چکیده
منابع مشابه
Bandwidth Allocation in ATM Networks: Heuristic Approach
In this paper, we present a heuristic approach to analyze a boundary of network bandwidth allocated to the source(s). This approach can be applied for Call Admission Control(CAC) in A T M Networks. Our approach applies two characteristic functions, a time E pant i le function to characterize the source behavior and a function to characterize a maximum amount of network bandwidth served b y the ...
متن کاملBandwidth Allocation By Pricing In ATM Networks
Admission control and bandwidth allocation are important issues in telecommunications networks, especially when there are random uctuating demands for service and variations in the service rates. In the emerging broadband communications environment these services are likely to be o ered via an ATM network. In order to make ATM future safe, methods for controlling the network should not be based...
متن کاملA Decentralized Framework to Achieve Max-min Fair Bandwidth Allocation for Atm Networks
We consider a flow control algorithm to allocate bandwidth in a network subject to throughput and fairness constraints. Our algorithm achieves a max-min fair allocation among contending users, and has desirable properties in that it can operate in a decentralized and asynchronous manner accounting in part for heterogeneity in round trip delays. The algorithm is simple in that, 1), the network l...
متن کاملBandwidth Allocation Problem in ATM
We show that the Bandwidth Allocation problem in the ATM network model is NP-Complete. Based on that inference we suggest using the Genetic Algorithm technique to select a subset of calls from the set of incoming call requests for transmission, so that the available network bandwidth is utilized eeectively, thus maximizing the revenue generated while preserving the promised QoS.
متن کاملFair and efficient dynamic bandwidth allocation for multi-application networks
The large diversity of applications and requirements posed to current network environments make the resource allocation problem difficult to work out. This paper proposes a dynamic algorithm based on weighted fair queueing (WFQ) to promote fairness (in the Rawlsian sense) and efficiency (in the Paretian sense) in the allocation of bandwidth for multi-application networks. Utility functions are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2002
ISSN: 0178-4617
DOI: 10.1007/s00453-001-0119-2